Exact Solutions of Holonomic Quantum Computation

نویسندگان

  • Shogo Tanimura
  • Daisuke Hayashi
  • Mikio Nakahara
چکیده

Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard, CNOT and 2-qubit discrete Fourier transformation gates are explicitly constructed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact solutions of the isoholonomic problem and the optimal control problem in holonomic quantum computation

The isoholonomic problem in a homogeneous bundle is formulated and solved exactly. The problem takes a form of a boundary value problem of a variational equation. The solution is applied to the optimal control problem in holonomic quantum computer. We provide a prescription to construct an optimal controller for an arbitrary unitary gate and apply it to a k-dimensional unitary gate which operat...

متن کامل

Exact solutions for universal holonomic quantum gates

We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one and two qubits gates. Our method is analytical and is not based on numerical search in the space of all loops. email:[email protected] email:[email protected]...

متن کامل

An Ansatz for the Singularities of Hypergeometric Multisums

Sequences that are defined by multisums of hypergeometric terms occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. When properly normalized, the generating series of the above sequences are convergent in a neighborhood of zero and holonomic, that is they satisfy a linear differential equation with polynomial coefficients. It foll...

متن کامل

Control algebra for holonomic quantum computation with squeezed coherent states

A condition for determining the holonomy group associated to a principal bundle with connection is proven. Within the context of Holonomic Quantum Computation, this condition aids in determining the universality of the system. We apply the theory to the product bundle arising from the full two-qubit system of holonomic computation with squeezed coherent states and conclude that the control alge...

متن کامل

Fault-tolerant holonomic quantum computation.

We explain how to combine holonomic quantum computation (HQC) with fault-tolerant quantum error correction. This establishes the scalability of HQC, putting it on equal footing with other models of computation, while retaining the inherent robustness the method derives from its geometric nature.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004